The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

ge(x, 0) → true
ge(0, s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0)), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0
if(true, x, y) → s(div(minus(x, y), y))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
ge(s(x), s(y)) →⁺ ge(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
ge, minus, div

They will be analysed ascendingly in the following order:
ge < div
minus < div

(8) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Generator Equations:
gen_0':s:divByZeroError3_0(0) ⇔ 0'
gen_0':s:divByZeroError3_0(+(x, 1)) ⇔ s(gen_0':s:divByZeroError3_0(x))

The following defined symbols remain to be analysed:
ge, minus, div

They will be analysed ascendingly in the following order:
ge < div
minus < div

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Induction Base:
ge(gen_0':s:divByZeroError3_0(0), gen_0':s:divByZeroError3_0(0)) →_R^Ω(1)
true

Induction Step:
ge(gen_0':s:divByZeroError3_0(+(n5_0, 1)), gen_0':s:divByZeroError3_0(+(n5_0, 1))) →_R^Ω(1)
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s:divByZeroError3_0(0) ⇔ 0'
gen_0':s:divByZeroError3_0(+(x, 1)) ⇔ s(gen_0':s:divByZeroError3_0(x))

The following defined symbols remain to be analysed:
minus, div

They will be analysed ascendingly in the following order:
minus < div

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_0':s:divByZeroError3_0(n276_0), gen_0':s:divByZeroError3_0(n276_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n276₀)

Induction Base:
minus(gen_0':s:divByZeroError3_0(0), gen_0':s:divByZeroError3_0(0)) →_R^Ω(1)
gen_0':s:divByZeroError3_0(0)

Induction Step:
minus(gen_0':s:divByZeroError3_0(+(n276_0, 1)), gen_0':s:divByZeroError3_0(+(n276_0, 1))) →_R^Ω(1)
minus(gen_0':s:divByZeroError3_0(n276_0), gen_0':s:divByZeroError3_0(n276_0)) →_IH
gen_0':s:divByZeroError3_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:divByZeroError3_0(n276_0), gen_0':s:divByZeroError3_0(n276_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n276₀)

Generator Equations:
gen_0':s:divByZeroError3_0(0) ⇔ 0'
gen_0':s:divByZeroError3_0(+(x, 1)) ⇔ s(gen_0':s:divByZeroError3_0(x))

The following defined symbols remain to be analysed:
div

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol div.

(16) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:divByZeroError3_0(n276_0), gen_0':s:divByZeroError3_0(n276_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n276₀)

Generator Equations:
gen_0':s:divByZeroError3_0(0) ⇔ 0'
gen_0':s:divByZeroError3_0(+(x, 1)) ⇔ s(gen_0':s:divByZeroError3_0(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(18) BOUNDS(n^1, INF)

(19) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:divByZeroError3_0(n276_0), gen_0':s:divByZeroError3_0(n276_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n276₀)

Generator Equations:
gen_0':s:divByZeroError3_0(0) ⇔ 0'
gen_0':s:divByZeroError3_0(+(x, 1)) ⇔ s(gen_0':s:divByZeroError3_0(x))

No more defined symbols left to analyse.

(20) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(21) BOUNDS(n^1, INF)

(22) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(x)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
div(x, y) → ify(ge(y, s(0')), x, y)
ify(false, x, y) → divByZeroError
ify(true, x, y) → if(ge(x, y), x, y)
if(false, x, y) → 0'
if(true, x, y) → s(div(minus(x, y), y))

Types:
ge :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
div :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
ify :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
if :: true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s:divByZeroError3_0(0) ⇔ 0'
gen_0':s:divByZeroError3_0(+(x, 1)) ⇔ s(gen_0':s:divByZeroError3_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
ge(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(24) BOUNDS(n^1, INF)